Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое undecidable - определение
WIKIMEDIA DISAMBIGUATION PAGE
Undecidability; Incomputability; Unsolvability; Undecidable (disambiguation)
Найдено результатов: 16
undecidable
¦ adjective not able to be firmly established or refuted.
Derivatives
undecidability noun
Undecidable problem
DECISION PROBLEM FOR WHICH IT IS IMPOSSIBLE TO CONSTRUCT AN ALGORITHM THAT ALWAYS LEADS TO A CORRECT YES-OR-NO ANSWER
Undecidable language; Semi-decidable; Undecidable set; Uncomputable problem; Unsolvable problem; Algorithmically insoluble; Algorithmic insolubility; Recursively undecidable; Algorithmically unsolvable problem
In computability theory and computational complexity theory, an undecidable problem is a decision problem for which it is proved to be impossible to construct an algorithm that always leads to a correct yes-or-no answer. The halting problem is an example: it can be proven that there is no algorithm that correctly determines whether arbitrary programs eventually halt when run.
List of undecidable problems
WIKIMEDIA LIST ARTICLE
List of undecidable problem
In computability theory, an undecidable problem is a type of computational problem that requires a yes/no answer, but where there cannot possibly be any computer program that always gives the correct answer; that is, any possible program would sometimes give the wrong answer or run forever without giving any answer. More formally, an undecidable problem is a problem whose language is not a recursive set; see the article Decidable language.
List of statements independent of ZFC
WIKIMEDIA LIST ARTICLE
List of statements undecidable in ZFC
The mathematical statements discussed below are independent of ZFC (the canonical axiomatic set theory of contemporary mathematics, consisting of the Zermelo–Fraenkel axioms plus the axiom of choice), assuming that ZFC is consistent. A statement is independent of ZFC (sometimes phrased "undecidable in ZFC") if it can neither be proven nor disproven from the axioms of ZFC.
Conjectural
PROPOSITION IN MATHEMATICS THAT IS UNPROVEN
Conjecture (mathematics); Conjectural; Conjectures; Conjectured; Mathematical conjecture; Undecidable conjectures; Disproved conjecture
·adj Dependent on conjecture; fancied; imagined; guessed at; undetermined; doubtful.
conjecture
PROPOSITION IN MATHEMATICS THAT IS UNPROVEN
Conjecture (mathematics); Conjectural; Conjectures; Conjectured; Mathematical conjecture; Undecidable conjectures; Disproved conjecture
(conjectures, conjecturing, conjectured)
1.
A conjecture is a conclusion that is based on information that is not certain or complete. (FORMAL)
That was a conjecture, not a fact...
There are several conjectures...
The attitudes of others were matters of conjecture although there were plenty of rumours about how individuals had behaved.
= surmise
N-VAR
2.
When you conjecture, you form an opinion or reach a conclusion on the basis of information that is not certain or complete. (FORMAL)
He conjectured that some individuals may be able to detect major calamities...
This may be true or partly true; we are all conjecturing here.
= surmise
VERB: V that, V
conjectural
PROPOSITION IN MATHEMATICS THAT IS UNPROVEN
Conjecture (mathematics); Conjectural; Conjectures; Conjectured; Mathematical conjecture; Undecidable conjectures; Disproved conjecture
a.
Presumptive, surmised, hypothetical, theoretical, suppositional.
conjecture
PROPOSITION IN MATHEMATICS THAT IS UNPROVEN
Conjecture (mathematics); Conjectural; Conjectures; Conjectured; Mathematical conjecture; Undecidable conjectures; Disproved conjecture
I. n.
Supposition, surmise, guess, hypothesis, theory.
II. v. a.
Surmise, guess, suppose, divine, suspect.
III. v. n.
Surmise, guess, suppose, suspect, fancy, dare say, take it, hazard the conjecture.
Decidability (logic)
PROPERTY OF THEORIES THAT HAVE COMPUTABLE MEMBERSHIP
Semidecidable; Decidability (Logic); Semidecidability; Essentially undecidable; Decidability (computer science); Decidable (logic); Semi-decidability
In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer. Zeroth-order logic (propositional logic) is decidable, whereas first-order and higher-order logic are not.
Conjecture
PROPOSITION IN MATHEMATICS THAT IS UNPROVEN
Conjecture (mathematics); Conjectural; Conjectures; Conjectured; Mathematical conjecture; Undecidable conjectures; Disproved conjecture
Википедия
Undecidable
Undecidable may refer to:
- Undecidable problem in computer science and mathematical logic, a decision problem that no algorithm can decide, formalized as an undecidable language or undecidable set
- "Undecidable", sometimes also used as a synonym of independent, something that can neither be proved nor disproved within a mathematical theory
- Undecidable figure, a two-dimensional drawing of something that cannot exist in 3d, such as appeared in some of the works of M. C. Escher
